Search reversion within s-metaheuristics: impacts illustrated with a forest planning problem
نویسندگان
چکیده
منابع مشابه
Forest Planning Heuristics—Current Recommendations and Research Opportunities for s-Metaheuristics
Adaptive forest management requires planning and implementation of activities designed to maintain or improve forest conditions, and in support of these endeavors knowledge of silviculture, economics, operations research, and other allied fields are necessary. With regard to forest planning, traditional (exact) mathematical techniques along with heuristics have been demonstrated as useful in de...
متن کاملThree New Stochastic Local Search Metaheuristics for the Annual Crop Planning Problem Based on a New Irrigation Scheme
Annual Crop Planning (ACP) is an NP-hard-type optimization problem in agricultural planning. It involves finding optimal solutions concerning the seasonal allocations of a limited amount of agricultural land amongst the various competing crops that are required to be grown on it. This study investigates the effectiveness of employing three new local search (LS) metaheuristic techniques in deter...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملUtilizing Problem Structure in Planning, A Local Search Approach
The book deals with general problem solving in the form given by the STRIPS planning formalism. Planning systems read in a STRIPS problem description, and then perform the search for a solution fully automatically, i.e., without any knowledge about the problem other than the transition rules that generate the search space. Starting from an existing approach to planning as heuristic search, I de...
متن کاملLocal Search for a Cargo Assembly Planning Problem
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Silva Fennica
سال: 2015
ISSN: 2242-4075
DOI: 10.14214/sf.1232